eCOMPASS – TR – 047 Approximation Algorithms for Arc Orienteering Problems
نویسندگان
چکیده
In this paper we study the Arc Orienteering Problem in directed and undirected graphs. To the best of our knowledge, we give the fist approximation algorithms for both the undirected and the directed versions of the problem. Our main results are the following: (i) We give an O( log 2(m) log log(m) )−approximation algorithm for the AOP in directed graphs, where m is the number of arcs of the graph of the problem, using the O( log 2(n) log log(n) )−approximation for the OP in directed graphs found in [13]. (ii) Using the (2 + )−approximation algorithm for the unweighted version of the OP in [6], we obtain a (6+ +o(1))−approximation algorithm for the AOP in undirected graphs and a (4+ )−approximation algorithm for the unweighted version of the AOP in undirected graphs. Moreover, we prove that the Mixed Orienteering Problem (MOP) can be reduced to AOP and that any approximation algorithm for the AOP yields an approximation algorithm for the MOP.
منابع مشابه
Orienteering Problem with Variable Profits, Fractional Objective Function and Demand on Arcs
Nowadays, due to the high expectations of customers in meeting their demand and the competition environment among service providers, employers are working to provide customers with new methods in the shortest possible time and in the best possible way to attract customer’s satisfaction and maximize profits. In this paper, the orienteering problem with variable profits, fractional objective func...
متن کاملPoly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
This paper studies vehicle routing problems on asymmetric metrics. Our starting point is the directed k-TSP problem: given an asymmetric metric (V, d), a root r ∈ V and a target k ≤ |V |, compute the minimum length tour that contains r and at least k other vertices. We present a polynomial time O(log n · log k)-approximation algorithm for this problem. We use this algorithm for directed k-TSP t...
متن کاملA branch-and-cut algorithm for the Orienteering Arc Routing Problem
In arc routing problems, customers are located on arcs, and routes of minimum cost have to be identified. In the Orienteering Arc Routing Problem (OARP), in addition to a set of regular customers that have to be serviced, a set of potential customers is available. From this latter set, customers have to be chosen on the basis of an associated profit. The objective is to find a route servicing t...
متن کاملCompact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing
We develop polynomial-size LP-relaxations for orienteering and the regret-bounded vehicle routing problem (RVRP) and devise suitable LP-rounding algorithms that lead to various new insights and approximation results for these problems. In orienteering, the goal is to find a maximum-reward r-rooted path, possibly ending at a specified node, of length at most some given budget B. In RVRP, the goa...
متن کاملOn the use of the energy norm in trust-region and adaptive cubic regularization subproblems
We consider solving unconstrained optimization problems by means of two popular globalization techniques: trust-region (TR) algorithms and adaptive regularized framework using cubics (ARC). Both techniques require the solution of a so-called “subproblem” in which a trial step is computed by solving an optimization problem involving an approximation of the objective function, called “the model”....
متن کامل